kw.\*:("Plus long chemin")
Results 1 to 15 of 15
Selection :
Stable set meeting every longest pathHAVET, F.Discrete mathematics. 2004, Vol 289, Num 1-3, pp 169-173, issn 0012-365X, 5 p.Article
A centroid labelling technique and its application to path selection in trees : (Extended abstract)RAMNATH, S; SHEN, H.Lecture notes in computer science. 1997, pp 368-377, issn 0302-9743, isbn 3-540-63307-3Conference Paper
Path partitions and Pn-free setsDUNBAR, Jean E; FRICK, Marietjie; BULLOCK, Frank et al.Discrete mathematics. 2004, Vol 289, Num 1-3, pp 145-155, issn 0012-365X, 11 p.Article
Embedding longest fault-free paths in arrangement graphs with faulty verticesLO, Ray-Shang; CHEN, Gen-Huey.Networks (New York, NY). 2001, Vol 37, Num 2, pp 84-93, issn 0028-3045Article
A note on the complexity of longest path problems related to graph coloringPARDALOS, P. M; MIGDALAS, A.Applied mathematics letters. 2004, Vol 17, Num 1, pp 13-15, issn 0893-9659, 3 p.Article
Finding a path of superlogarithmic lengthBJÖRKLUND, Andreas; HUSFELDT, Thore.SIAM journal on computing (Print). 2003, Vol 32, Num 6, pp 1395-1402, issn 0097-5397, 8 p.Article
Lower bounds for linear interval routingEILAM, T; MORAN, S; ZAKS, S et al.Networks (New York, NY). 1999, Vol 34, Num 1, pp 37-46, issn 0028-3045Article
Longest path partitions in generalizations of tournamentsBANG-JENSEN, Jørgen; NIELSEN, Morten Hegner; YEO, Anders et al.Discrete mathematics. 2006, Vol 306, Num 16, pp 1830-1839, issn 0012-365X, 10 p.Article
Maintaining longest paths in cyclic graphsKATRIEL, Irit; VAN HENTENRYCK, Pascal.Lecture notes in computer science. 2005, pp 358-372, issn 0302-9743, isbn 3-540-29238-1, 1Vol, 15 p.Conference Paper
Using stable sets to bound the chromatic numberDE WERRA, D; HANSEN, P.Information processing letters. 2003, Vol 87, Num 3, pp 127-131, issn 0020-0190, 5 p.Article
Parallel simulation by multi-instruction, longest-path algorithmsCHEN, L.Queueing systems. 1997, Vol 27, Num 1-2, pp 37-54, issn 0257-0130Article
LES PROBLÈMES D'OPTIMISATION COMBINATOIRE PROBABILISTES DANS LES GRAPHES = PROBABILISTIC COMBINATORIAL OPTIMIZATION PROBLEMS ON GRAPHSMurat, Cecile; Paschos, Vangelis.1997, 193 p.Thesis
Nondifferentiability of the time constants of first-passage percolationSTEELE, J. Michael; YU ZHANG.Annals of probability. 2003, Vol 31, Num 2, pp 1028-1051, issn 0091-1798, 24 p.Article
Hamiltonian-laceability of star graphsHSIEH, Sun-Yuan; CHEN, Gen-Huey; HO, Chin-Wen et al.Networks (New York, NY). 2000, Vol 36, Num 4, pp 225-232, issn 0028-3045Article
The probabilistic longest path problemMURAT, C; PASCHOS, V. T.Networks (New York, NY). 1999, Vol 33, Num 3, pp 207-219, issn 0028-3045Article
